Approximation Algorithms for Some Graph Partitioning Problems
نویسندگان
چکیده
منابع مشابه
Approximation Algorithms for Some Graph Partitioning Problems
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that each color class is totally partitioned. Equivalently, given a weighted complete k-partite graph, cover its vertices with a minimum number of disjoint cliques in such a way that the total weight of the cliques is maximize...
متن کاملApproximation Algorithms for Semi-random Graph Partitioning Problems
In this paper, we propose and study a new semi-random model for graph partitioning problems. We believe that it captures many properties of real–world instances. The model is more flexible than the semi-random model of Feige and Kilian and planted random model of Bui, Chaudhuri, Leighton and Sipser. We develop a general framework for solving semi-random instances and apply it to several problem...
متن کاملImproved Approximation Algorithms for Maximum Graph Partitioning Problems
In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k-UNCUT, MAX-k-DIRECTEDCUT, MAX-k-DIRECTED-UNCUT, MAX-k-DENSE-SUBGRAPH, and MAX-k-VERTEX-COVER. It was observed by Han, Ye, Zhang (2002) and Halperin, Zwick (2002) that a parameter-driven random hyperplane can lead to better approximation...
متن کاملApproximation Algorithms for Maximization Problems Arising in Graph Partitioning
Given a graph G = (V;E), a weight function w : E ! R+ and a parameter k we examine a family of maximization problems arising naturally when considering a subset U V of size exactly k. Speci cally we consider the problem of nding a subset U V of size k that maximizes : Max-k-Vertex Cover : the weight of edges incident with vertices in U . Max-k-Dense Subgraph : the weight of edges in the subgrap...
متن کاملApproximation algorithms for array partitioning problems
We study the problem of optimally partitioning a two-dimensional array of elements by cutting each coordinate axis into (resp., ) intervals, resulting in rectangular regions. This problem arises in several applications in databases, parallel computation, and image processing. Our main contribution are new approximation algorithms for these NP-Complete problems that improve significantly over pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2000
ISSN: 1526-1719
DOI: 10.7155/jgaa.00021